Fugitive-search games on graphs and related parameters
نویسندگان
چکیده
منابع مشابه
Fugitive-Search Games on Graphs and Related Parameters
The goal of a fugitive-search game on a graph is to trap a fugitive that hides on the vertices of the graph by systematically placing searchers on the vertices. The fugitive is assumed to have complete knowledge of the graph and of the searchers’ moves, but is restricted to move only along paths whose vertices are not guarded by searchers. The search number of the graph is the least number of s...
متن کاملMonotonicity and inert fugitive search games
In general, graph search can be described in terms of a sequence of searchers’ moves on a graph, able to capture a fugitive resorting on its vertices/edges. Several variations of graph search have been introduced, differing on the abilities of the fugitive as well as of the search. In this paper, we examine the case where the fugitive is inert, i.e., it moves only whenever the search is about t...
متن کاملResearch Proposal: Rendevous Problems and Search Games on Planar Graphs
Since seeing a couple very simple graph theory problems in middle school, graph theory has captured my attention. My first algorithms course was last year and it was one of my favorite classes. I’m currently taking Extremal Combinatorics which has covered a variety of graph theory problems. Last summer, I also was in an REU which worked on a graph theory problem and really enjoyed working on pr...
متن کاملEfficient Local Search in Coordination Games on Graphs
We study strategic games on weighted directed graphs, where the payoff of a player is defined as the sum of the weights on the edges from players who chose the same strategy augmented by a fixed non-negative bonus for picking a given strategy. These games capture the idea of coordination in the absence of globally common strategies. Prior work shows that the problem of determining the existence...
متن کاملOn Treewidth and Related Parameters of Random Geometric Graphs
We give asymptotically exact values for the treewidth tw(G) of a random geometric graph G ∈ G(n, r) in [0, √ n]. More precisely, let rc denote the threshold radius for the appearance of the giant component in G(n, r). We then show that for any constant 0 < r < rc, tw(G) = Θ( logn log logn ), and for c being sufficiently large, and r = r(n) ≥ c, tw(G) = Θ(r √ n). Our proofs show that for the cor...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 1997
ISSN: 0304-3975
DOI: 10.1016/s0304-3975(96)00177-6